________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        04.02.2010 23:49:35
Input Data from:  dataset220.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :40
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,153
Average f[i]   :4850
Average g[i,j] :2000
Total demand   :6020
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 38
> Selected Move:	1200	1	-1	25	4000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1200


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 181
> Selected Move:	1460	1	-1	3	8500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1460


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 182
> Selected Move:	1740	3	0	8	10600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1740


> New S[]: 
	
	 0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 211
> Selected Move:	2690	1	-1	14	15100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  2  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2690


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 238
> Selected Move:	3130	1	-1	38	20100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  2  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0    >new incumb.: 3130


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 267
> Selected Move:	3600	1	-1	19	24100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  2  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0    >new incumb.: 3600


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 232
> Selected Move:	3630	3	8	23	24100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0    >new incumb.: 3630


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 197
> Selected Move:	3630	4	23	25	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  2  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 162
> Selected Move:	3630	4	25	38	24900


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 162
> Selected Move:	3640	3	38	22	24800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  2  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3640


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 157
> Selected Move:	3690	3	14	21	24300


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  2  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3690


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 159
> Selected Move:	3670	3	23	26	22800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 225
> Selected Move:	3690	3	21	14	23300


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 229
> Selected Move:	3690	4	22	25	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 122
> Selected Move:	3670	3	14	21	24500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  2  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 143
> Selected Move:	3670	4	25	3	24800


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 115
> Selected Move:	3670	4	3	19	24700


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 129
> Selected Move:	3670	4	19	26	24600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1  2  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 148
> Selected Move:	3646	3	21	14	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0  1  2  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 134
> Selected Move:	3630	3	22	38	23600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  2  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 234
> Selected Move:	3630	4	26	3	23800


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 229
> Selected Move:	3630	4	3	14	24000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 221
> Selected Move:	3630	4	14	19	23700


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  2  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 232
> Selected Move:	3630	4	19	25	23500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  2  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 234
> Selected Move:	3630	4	25	38	23400


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 243
> Selected Move:	3620	3	19	11	24900


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 204
> Selected Move:	3620	4	38	11	24100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 242
> Selected Move:	3630	3	11	16	24100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  2  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 233
> Selected Move:	3630	3	16	37	23900


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  2  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 266
> Selected Move:	3620	3	37	24	24000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  2  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 241
> Selected Move:	3620	4	24	25	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  2  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 203
> Selected Move:	3620	4	25	38	24900


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 206
> Selected Move:	3620	3	24	33	24900


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  2  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 215
> Selected Move:	3620	4	38	25	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  2  1  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 217
> Selected Move:	3620	4	25	33	23600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  2  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 271
> Selected Move:	3585	4	33	26	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  2  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 227
> Selected Move:	3585	3	33	11	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  2  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 214
> Selected Move:	3620	4	26	25	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  2  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 228
> Selected Move:	3610	3	14	28	24500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2  1  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 230
> Selected Move:	3610	4	25	3	24800


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 216
> Selected Move:	3610	4	3	11	23600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 265
> Selected Move:	3610	4	11	26	24600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  2  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 222
> Selected Move:	3610	4	26	28	24800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 215
> Selected Move:	3610	4	28	38	24400


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 252
> Selected Move:	3610	3	11	24	24400


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  1  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 228
> Selected Move:	3610	4	38	3	24800


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 219
> Selected Move:	3610	4	3	24	23500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  1  1  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 269
> Selected Move:	3610	4	24	25	24500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  2  1  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 229
> Selected Move:	3610	4	25	26	24600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  2  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 225
> Selected Move:	3610	4	26	28	24800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 252
> Selected Move:	3610	3	28	31	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  2  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 213
> Selected Move:	3610	4	31	24	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  1  1  0  0  0  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 241
> Selected Move:	3583	3	24	11	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 216
> Selected Move:	3610	4	11	31	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  2  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 251
> Selected Move:	3584	3	31	17	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 254
> Selected Move:	3585	3	11	24	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 251
> Selected Move:	3580	3	24	19	23600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 250
> Selected Move:	3666	3	38	22	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 178
> Selected Move:	3690	4	17	22	24800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 232
> Selected Move:	3600	3	17	31	24300


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 190
> Selected Move:	3600	4	22	31	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  1  0  0  0  0  2  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 189
> Selected Move:	3625	3	31	21	25200


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  2  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 62 #######################


> Neighbours evaluated; 218
> Selected Move:	3575	3	21	14	25500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 63 #######################


> Neighbours evaluated; 160
> Selected Move:	3643	4	14	19	25200


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 64 #######################


> Neighbours evaluated; 173
> Selected Move:	3618	4	19	3	25300


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 65 #######################


> Neighbours evaluated; 212
> Selected Move:	3531	3	3	21	25200


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  2  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 66 #######################


> Neighbours evaluated; 165
> Selected Move:	3580	4	21	14	25000


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  1  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 67 #######################


> Neighbours evaluated; 165
> Selected Move:	3580	4	14	19	24700


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  2  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 68 #######################


> Neighbours evaluated; 188
> Selected Move:	3580	4	19	22	22800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 69 #######################


> Neighbours evaluated; 258
> Selected Move:	3580	4	22	25	24500


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0  2  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 70 #######################


> Neighbours evaluated; 200
> Selected Move:	3580	4	25	26	24600


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0  1  2  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 71 #######################


> Neighbours evaluated; 233
> Selected Move:	3533	3	26	8	25100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  2  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 72 #######################


> Neighbours evaluated; 234
> Selected Move:	3560	4	8	22	24300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  1  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 73 #######################


> Neighbours evaluated; 248
> Selected Move:	3540	3	14	3	24300


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 74 #######################


> Neighbours evaluated; 247
> Selected Move:	3580	3	8	15	24800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 75 #######################


> Neighbours evaluated; 214
> Selected Move:	3570	3	15	39	23800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 76 #######################


> Neighbours evaluated; 236
> Selected Move:	3570	4	22	39	24800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 77 #######################


> Neighbours evaluated; 208
> Selected Move:	3665	3	39	23	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 78 #######################


> Neighbours evaluated; 193
> Selected Move:	3560	3	22	38	23600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 79 #######################


> Neighbours evaluated; 249
> Selected Move:	3580	3	21	28	23600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  2  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 80 #######################


> Neighbours evaluated; 250
> Selected Move:	3580	4	23	3	24800


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 81 #######################


> Neighbours evaluated; 223
> Selected Move:	3580	4	3	19	24700


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 82 #######################


> Neighbours evaluated; 216
> Selected Move:	3584	3	28	14	25200


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  2  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 83 #######################


> Neighbours evaluated; 224
> Selected Move:	3563	4	19	3	25300


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 84 #######################


> Neighbours evaluated; 223
> Selected Move:	3560	3	3	35	24800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 85 #######################


> Neighbours evaluated; 254
> Selected Move:	3560	4	35	23	24600


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 86 #######################


> Neighbours evaluated; 262
> Selected Move:	3560	3	14	21	24100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  2  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 87 #######################


> Neighbours evaluated; 239
> Selected Move:	3560	4	23	25	25000


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  2  0  0  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 88 #######################


> Neighbours evaluated; 210
> Selected Move:	3560	4	25	35	24300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  2  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 89 #######################


> Neighbours evaluated; 234
> Selected Move:	3560	4	35	38	24900


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 90 #######################


> Neighbours evaluated; 222
> Selected Move:	3560	3	35	3	24400


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 91 #######################


> Neighbours evaluated; 232
> Selected Move:	3580	3	21	28	24400


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 92 #######################


> Neighbours evaluated; 243
> Selected Move:	3580	4	38	25	24500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  2  0  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 93 #######################


> Neighbours evaluated; 244
> Selected Move:	3580	4	25	28	24800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 94 #######################


> Neighbours evaluated; 253
> Selected Move:	3580	3	23	26	23300


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  2  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 95 #######################


> Neighbours evaluated; 265
> Selected Move:	3580	4	28	3	23300


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 96 #######################


> Neighbours evaluated; 265
> Selected Move:	3580	4	3	19	23200


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 97 #######################


> Neighbours evaluated; 267
> Selected Move:	3580	4	19	25	23000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  2  1  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 98 #######################


> Neighbours evaluated; 268
> Selected Move:	3580	4	25	26	23100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  2  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 99 #######################


> Neighbours evaluated; 267
> Selected Move:	3580	4	26	38	22900


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 100 #######################


> Neighbours evaluated; 269
> Selected Move:	3580	3	19	16	24900


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 101 #######################


> Neighbours evaluated; 245
> Selected Move:	3580	4	38	16	23600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 102 #######################


> Neighbours evaluated; 266
> Selected Move:	3580	4	16	25	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  2  1  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 103 #######################


> Neighbours evaluated; 247
> Selected Move:	3580	3	16	37	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  1  0  1  0  0  0  0  0  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 104 #######################


> Neighbours evaluated; 289
> Selected Move:	3580	4	25	37	23400


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0  2  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 105 #######################


> Neighbours evaluated; 294
> Selected Move:	3580	4	37	38	24900


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0  1  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 106 #######################


> Neighbours evaluated; 289
> Selected Move:	3586	3	28	14	25400


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 107 #######################


> Neighbours evaluated; 284
> Selected Move:	3659	3	38	22	25300


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 108 #######################


> Neighbours evaluated; 258
> Selected Move:	3670	3	14	21	24800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,0949999999999996

## ITERATION 109 #######################


> Neighbours evaluated; 263
> Selected Move:	3670	4	22	37	24900


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  2  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,0899999999999996

## ITERATION 110 #######################


> Neighbours evaluated; 274
> Selected Move:	3661	3	37	16	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 111 #######################


> Neighbours evaluated; 228
> Selected Move:	3670	4	16	22	24800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 112 #######################


> Neighbours evaluated; 257
> Selected Move:	3666	3	21	14	25300


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 113 #######################


> Neighbours evaluated; 257
> Selected Move:	3645	4	22	16	25600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  2  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 114 #######################


> Neighbours evaluated; 257
> Selected Move:	3658	3	16	37	25400


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  2  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 115 #######################


> Neighbours evaluated; 278
> Selected Move:	3600	3	37	9	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  2  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 116 #######################


> Neighbours evaluated; 246
> Selected Move:	3600	4	9	22	24300


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 117 #######################


> Neighbours evaluated; 255
> Selected Move:	3607	1	-1	21	28300


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 118 #######################


> Neighbours evaluated; 277
> Selected Move:	3690	3	9	19	27300


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 119 #######################


> Neighbours evaluated; 293
> Selected Move:	3736	3	3	35	27800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 120 #######################


> Neighbours evaluated; 291
> Selected Move:	3685	3	22	0	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 121 #######################


> Neighbours evaluated; 317
> Selected Move:	3683	3	25	34	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,12

## ITERATION 122 #######################


> Neighbours evaluated; 325
> Selected Move:	3740	3	35	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0    >new incumb.: 3740


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 123 #######################


> Neighbours evaluated; 330
> Selected Move:	3755	3	26	32	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 124 #######################


> Neighbours evaluated; 327
> Selected Move:	3710	3	3	6	26000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 125 #######################


> Neighbours evaluated; 322
> Selected Move:	3740	3	32	26	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 126 #######################


> Neighbours evaluated; 322
> Selected Move:	3720	3	14	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 127 #######################


> Neighbours evaluated; 319
> Selected Move:	3735	3	26	39	26000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,15

## ITERATION 128 #######################


> Neighbours evaluated; 272
> Selected Move:	3680	3	3	14	26000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 129 #######################


> Neighbours evaluated; 314
> Selected Move:	3705	3	34	26	26000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 130 #######################


> Neighbours evaluated; 316
> Selected Move:	3660	3	39	25	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 131 #######################


> Neighbours evaluated; 322
> Selected Move:	3660	3	14	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 132 #######################


> Neighbours evaluated; 315
> Selected Move:	3660	3	25	28	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 133 #######################


> Neighbours evaluated; 282
> Selected Move:	3780	3	21	12	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3780


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 134 #######################


> Neighbours evaluated; 267
> Selected Move:	3730	3	6	11	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 135 #######################


> Neighbours evaluated; 304
> Selected Move:	3745	3	28	21	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 136 #######################


> Neighbours evaluated; 290
> Selected Move:	3690	3	11	24	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 137 #######################


> Neighbours evaluated; 249
> Selected Move:	3685	3	21	28	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 138 #######################


> Neighbours evaluated; 261
> Selected Move:	3630	3	24	13	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 139 #######################


> Neighbours evaluated; 275
> Selected Move:	3625	3	28	21	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 140 #######################


> Neighbours evaluated; 262
> Selected Move:	3620	3	3	14	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  1  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 141 #######################


> Neighbours evaluated; 272
> Selected Move:	3610	3	13	6	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 142 #######################


> Neighbours evaluated; 279
> Selected Move:	3680	3	21	3	25500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 143 #######################


> Neighbours evaluated; 237
> Selected Move:	3745	3	6	39	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 144 #######################


> Neighbours evaluated; 288
> Selected Move:	3740	3	39	34	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 145 #######################


> Neighbours evaluated; 302
> Selected Move:	3668	3	34	23	26500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 146 #######################


> Neighbours evaluated; 278
> Selected Move:	3630	3	23	32	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 147 #######################


> Neighbours evaluated; 294
> Selected Move:	3603	3	32	8	26500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 148 #######################


> Neighbours evaluated; 313
> Selected Move:	3565	3	8	11	26500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 149 #######################


> Neighbours evaluated; 288
> Selected Move:	3565	3	3	21	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 150 #######################


> Neighbours evaluated; 262
> Selected Move:	3560	3	11	24	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 151 #######################


> Neighbours evaluated; 271
> Selected Move:	3538	3	24	35	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 152 #######################


> Neighbours evaluated; 271
> Selected Move:	3625	3	14	6	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 153 #######################


> Neighbours evaluated; 167
> Selected Move:	3633	3	21	28	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 154 #######################


> Neighbours evaluated; 163
> Selected Move:	3610	3	6	21	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 155 #######################


> Neighbours evaluated; 209
> Selected Move:	3555	3	12	38	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 156 #######################


> Neighbours evaluated; 263
> Selected Move:	3575	3	35	3	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 157 #######################


> Neighbours evaluated; 293
> Selected Move:	3563	3	28	34	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 158 #######################


> Neighbours evaluated; 284
> Selected Move:	3560	3	3	14	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 159 #######################


> Neighbours evaluated; 275
> Selected Move:	3480	3	14	28	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 160 #######################


> Neighbours evaluated; 284
> Selected Move:	3480	3	38	3	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 161 #######################


> Neighbours evaluated; 298
> Selected Move:	3660	3	26	6	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,3

## ITERATION 162 #######################


> Neighbours evaluated; 262
> Selected Move:	3590	3	21	26	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 163 #######################


> Neighbours evaluated; 258
> Selected Move:	3650	3	34	25	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 164 #######################


> Neighbours evaluated; 247
> Selected Move:	3520	3	3	14	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 165 #######################


> Neighbours evaluated; 291
> Selected Move:	3610	3	25	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 166 #######################


> Neighbours evaluated; 269
> Selected Move:	3530	3	12	21	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 167 #######################


> Neighbours evaluated; 296
> Selected Move:	3520	2	28	-1	21000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 168 #######################


> Neighbours evaluated; 267
> Selected Move:	3610	3	1	29	23300


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 169 #######################


> Neighbours evaluated; 223
> Selected Move:	3640	3	0	25	24800


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  2  1  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 170 #######################


> Neighbours evaluated; 198
> Selected Move:	3640	4	25	6	24700


> New Y[]: 
	
	 0  0  4  0  0  0  2  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  1  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 171 #######################


> Neighbours evaluated; 207
> Selected Move:	3640	4	6	19	25000


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  2  0  1  0  0  0  1  1  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 172 #######################


> Neighbours evaluated; 200
> Selected Move:	3640	4	19	26	24900


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  2  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 173 #######################


> Neighbours evaluated; 198
> Selected Move:	3640	4	26	29	24600


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  3  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 174 #######################


> Neighbours evaluated; 210
> Selected Move:	3650	3	26	8	24500


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  3  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 175 #######################


> Neighbours evaluated; 218
> Selected Move:	3650	3	25	7	25000


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  3  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 176 #######################


> Neighbours evaluated; 192
> Selected Move:	3616	3	8	26	25100


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  3  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 177 #######################


> Neighbours evaluated; 177
> Selected Move:	3640	4	26	6	24300


> New Y[]: 
	
	 0  0  4  0  0  0  3  1  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 178 #######################


> Neighbours evaluated; 220
> Selected Move:	3640	4	6	7	24500


> New Y[]: 
	
	 0  0  4  0  0  0  1  3  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 179 #######################


> Neighbours evaluated; 205
> Selected Move:	3640	4	7	14	24300


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  0  0  0  0  0  0  3  0  0  0  0  1  0  1  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 180 #######################


> Neighbours evaluated; 217
> Selected Move:	3640	4	14	21	25000


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  1  0  3  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 181 #######################


> Neighbours evaluated; 201
> Selected Move:	3640	3	7	25	24500


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  3  0  0  0  1  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 182 #######################


> Neighbours evaluated; 227
> Selected Move:	3640	4	21	6	23800


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 183 #######################


> Neighbours evaluated; 250
> Selected Move:	3640	4	6	14	23800


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  1  0  1  0  0  0  1  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 184 #######################


> Neighbours evaluated; 248
> Selected Move:	3640	4	14	19	24900


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  3  0  1  0  0  0  1  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 185 #######################


> Neighbours evaluated; 231
> Selected Move:	3640	4	19	25	24600


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  3  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 186 #######################


> Neighbours evaluated; 246
> Selected Move:	3507	4	29	6	25700


> New Y[]: 
	
	 0  0  4  0  0  0  2  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  3  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 187 #######################


> Neighbours evaluated; 204
> Selected Move:	3640	4	6	25	25000


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  2  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 188 #######################


> Neighbours evaluated; 223
> Selected Move:	3640	4	6	14	25000


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  1  0  1  0  0  0  2  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 189 #######################


> Neighbours evaluated; 229
> Selected Move:	3640	4	25	6	24900


> New Y[]: 
	
	 0  0  4  0  0  0  2  0  0  0  0  0  0  0  3  0  0  0  0  1  0  1  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 190 #######################


> Neighbours evaluated; 242
> Selected Move:	3623	4	6	26	25100


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  1  0  1  0  0  0  1  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 191 #######################


> Neighbours evaluated; 234
> Selected Move:	3624	4	14	6	25100


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 192 #######################


> Neighbours evaluated; 237
> Selected Move:	3608	4	26	19	25200


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  2  0  1  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 193 #######################


> Neighbours evaluated; 246
> Selected Move:	3609	4	6	14	25200


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  2  0  1  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 194 #######################


> Neighbours evaluated; 254
> Selected Move:	3576	3	19	37	25400


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  2  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 195 #######################


> Neighbours evaluated; 137
> Selected Move:	3607	4	14	29	25200


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  1  0  0  3  0  0  0  0  0  0  0  2  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 196 #######################


> Neighbours evaluated; 145
> Selected Move:	3623	4	29	37	25100


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  1  0  0  2  0  0  0  0  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 197 #######################


> Neighbours evaluated; 174
> Selected Move:	3550	3	37	16	24500


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  3  0  0  0  0  1  0  0  0  1  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 198 #######################


> Neighbours evaluated; 269
> Selected Move:	3560	3	29	9	24200


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  2  0  0  0  0  1  0  3  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 199 #######################


> Neighbours evaluated; 250
> Selected Move:	3542	4	9	6	25100


> New Y[]: 
	
	 0  0  4  0  0  0  2  0  0  1  0  0  0  0  1  0  3  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 200 #######################


> Neighbours evaluated; 227
> Selected Move:	3541	4	6	16	25100


> New Y[]: 
	
	 0  0  4  0  0  0  3  0  0  1  0  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 201 #######################


> Neighbours evaluated; 226
> Selected Move:	3541	4	6	14	25100


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  1  0  0  0  0  3  0  2  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 202 #######################


> Neighbours evaluated; 229
> Selected Move:	3520	4	14	9	25200


> New Y[]: 
	
	 0  0  4  0  0  0  1  0  0  3  0  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 203 #######################


> Neighbours evaluated; 221
> Selected Move:	3530	3	9	1	23100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 204 #######################


> Neighbours evaluated; 260
> Selected Move:	3559	3	6	22	25100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  2  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 205 #######################


> Neighbours evaluated; 194
> Selected Move:	3580	4	16	22	24800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 206 #######################


> Neighbours evaluated; 230
> Selected Move:	3580	3	16	9	23800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 207 #######################


> Neighbours evaluated; 234
> Selected Move:	3600	3	14	3	23800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 208 #######################


> Neighbours evaluated; 215
> Selected Move:	3600	4	22	9	24500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 209 #######################


> Neighbours evaluated; 199
> Selected Move:	3580	3	3	14	24500


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 210 #######################


> Neighbours evaluated; 211
> Selected Move:	3580	3	9	29	24800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 211 #######################


> Neighbours evaluated; 236
> Selected Move:	3580	4	29	22	24300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  2  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 212 #######################


> Neighbours evaluated; 264
> Selected Move:	3580	3	25	7	24800


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  2  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 213 #######################


> Neighbours evaluated; 253
> Selected Move:	3540	3	22	6	24400


> New Y[]: 
	
	 0  3  4  0  0  0  2  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 214 #######################


> Neighbours evaluated; 249
> Selected Move:	3540	4	6	7	24700


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 215 #######################


> Neighbours evaluated; 242
> Selected Move:	3540	4	7	14	25000


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  0  0  0  2  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 216 #######################


> Neighbours evaluated; 243
> Selected Move:	3540	4	14	26	24600


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 217 #######################


> Neighbours evaluated; 249
> Selected Move:	3540	4	26	29	23300


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 218 #######################


> Neighbours evaluated; 280
> Selected Move:	3564	3	1	19	25400


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  3  0  1  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 219 #######################


> Neighbours evaluated; 224
> Selected Move:	3550	3	19	16	25000


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  0  0  0  0  0  0  1  0  3  0  0  0  0  1  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 220 #######################


> Neighbours evaluated; 265
> Selected Move:	3532	3	16	37	25600


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 221 #######################


> Neighbours evaluated; 142
> Selected Move:	3518	4	29	37	25700


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0  2  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 222 #######################


> Neighbours evaluated; 145
> Selected Move:	3555	3	37	19	25500


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  2  0  1  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 223 #######################


> Neighbours evaluated; 212
> Selected Move:	3607	4	19	6	25200


> New Y[]: 
	
	 0  0  4  0  0  0  2  1  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 224 #######################


> Neighbours evaluated; 230
> Selected Move:	3572	4	6	26	25400


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  2  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 225 #######################


> Neighbours evaluated; 221
> Selected Move:	3553	4	26	7	25500


> New Y[]: 
	
	 0  0  4  0  0  0  1  2  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 226 #######################


> Neighbours evaluated; 217
> Selected Move:	3514	4	29	6	25700


> New Y[]: 
	
	 0  0  4  0  0  0  3  2  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 227 #######################


> Neighbours evaluated; 190
> Selected Move:	3610	3	7	0	23500


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 228 #######################


> Neighbours evaluated; 239
> Selected Move:	3610	4	6	14	23500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 229 #######################


> Neighbours evaluated; 237
> Selected Move:	3610	4	14	19	24600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  3  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 230 #######################


> Neighbours evaluated; 214
> Selected Move:	3610	4	19	21	24200


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  3  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 231 #######################


> Neighbours evaluated; 217
> Selected Move:	3610	4	21	26	24300


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 232 #######################


> Neighbours evaluated; 237
> Selected Move:	3610	3	26	8	24200


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  3  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 233 #######################


> Neighbours evaluated; 237
> Selected Move:	3610	4	8	6	25000


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  1  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 234 #######################


> Neighbours evaluated; 211
> Selected Move:	3610	4	6	14	25000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  0  0  0  3  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 235 #######################


> Neighbours evaluated; 221
> Selected Move:	3610	4	14	29	24800


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 236 #######################


> Neighbours evaluated; 241
> Selected Move:	3520	3	8	23	24800


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  1  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 237 #######################


> Neighbours evaluated; 243
> Selected Move:	3520	4	29	6	25000


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 238 #######################


> Neighbours evaluated; 236
> Selected Move:	3520	4	6	14	25000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  1  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 239 #######################


> Neighbours evaluated; 240
> Selected Move:	3520	4	14	23	24800


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  3  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 240 #######################


> Neighbours evaluated; 262
> Selected Move:	3480	3	23	36	24000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  3  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 241 #######################


> Neighbours evaluated; 272
> Selected Move:	3480	4	36	6	25000


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 242 #######################


> Neighbours evaluated; 251
> Selected Move:	3480	4	6	14	25000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 243 #######################


> Neighbours evaluated; 254
> Selected Move:	3480	4	14	29	24800


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 244 #######################


> Neighbours evaluated; 273
> Selected Move:	3470	3	36	32	24300


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 245 #######################


> Neighbours evaluated; 270
> Selected Move:	3470	4	29	6	24500


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 246 #######################


> Neighbours evaluated; 261
> Selected Move:	3470	4	6	14	24500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 247 #######################


> Neighbours evaluated; 268
> Selected Move:	3470	4	14	32	24600


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 248 #######################


> Neighbours evaluated; 271
> Selected Move:	3444	4	32	21	25200


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  3  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 249 #######################


> Neighbours evaluated; 273
> Selected Move:	3523	3	32	8	25700


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  1  0  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 250 #######################


> Neighbours evaluated; 246
> Selected Move:	3490	3	21	17	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  0  0  0  1  0  0  3  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 251 #######################


> Neighbours evaluated; 248
> Selected Move:	3540	3	8	26	24000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  3  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 252 #######################


> Neighbours evaluated; 227
> Selected Move:	3580	3	17	4	24900


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 253 #######################


> Neighbours evaluated; 213
> Selected Move:	3496	4	4	29	25800


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 254 #######################


> Neighbours evaluated; 197
> Selected Move:	3510	3	4	17	25300


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 255 #######################


> Neighbours evaluated; 216
> Selected Move:	3488	4	29	6	25500


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 256 #######################


> Neighbours evaluated; 209
> Selected Move:	3485	4	6	14	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  3  0  0  1  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 257 #######################


> Neighbours evaluated; 214
> Selected Move:	3465	3	17	4	26000


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  0  0  0  3  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 258 #######################


> Neighbours evaluated; 185
> Selected Move:	3460	4	14	6	26000


> New Y[]: 
	
	 2  0  4  0  1  0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 259 #######################


> Neighbours evaluated; 199
> Selected Move:	3388	3	14	28	25500


> New Y[]: 
	
	 2  0  4  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 260 #######################


> Neighbours evaluated; 241
> Selected Move:	3450	4	6	4	24400


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 261 #######################


> Neighbours evaluated; 259
> Selected Move:	3410	4	4	29	25300


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 262 #######################


> Neighbours evaluated; 257
> Selected Move:	3350	3	4	17	24800


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  1  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 263 #######################


> Neighbours evaluated; 260
> Selected Move:	3357	3	28	3	25300


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 264 #######################


> Neighbours evaluated; 207
> Selected Move:	3420	3	17	21	23300


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 265 #######################


> Neighbours evaluated; 262
> Selected Move:	3450	3	6	38	23800


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 266 #######################


> Neighbours evaluated; 280
> Selected Move:	3480	3	3	11	24800


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 267 #######################


> Neighbours evaluated; 221
> Selected Move:	3480	4	29	11	24900


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 268 #######################


> Neighbours evaluated; 227
> Selected Move:	3480	3	11	24	24900


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  3  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 269 #######################


> Neighbours evaluated; 222
> Selected Move:	3480	4	24	29	24800


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1  0  0  3  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 270 #######################


> Neighbours evaluated; 229
> Selected Move:	3480	3	29	3	24500


> New Y[]: 
	
	 2  0  4  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 271 #######################


> Neighbours evaluated; 282
> Selected Move:	3490	3	38	14	24000


> New Y[]: 
	
	 2  0  4  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 272 #######################


> Neighbours evaluated; 269
> Selected Move:	3500	3	3	35	24200


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0  0  0  3  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,135

## ITERATION 273 #######################


> Neighbours evaluated; 270
> Selected Move:	3500	4	35	14	24000


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,13

## ITERATION 274 #######################


> Neighbours evaluated; 276
> Selected Move:	3500	4	14	21	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  3  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,125

## ITERATION 275 #######################


> Neighbours evaluated; 267
> Selected Move:	3500	4	21	24	23900


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  3  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,12

## ITERATION 276 #######################


> Neighbours evaluated; 273
> Selected Move:	3500	4	24	26	24800


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  1  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,115

## ITERATION 277 #######################


> Neighbours evaluated; 267
> Selected Move:	3500	3	24	11	24800


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,11

## ITERATION 278 #######################


> Neighbours evaluated; 291
> Selected Move:	3500	4	26	11	23900


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  3  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,105

## ITERATION 279 #######################


> Neighbours evaluated; 293
> Selected Move:	3506	3	19	16	25900


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  3  0  0  1  0  1  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 280 #######################


> Neighbours evaluated; 286
> Selected Move:	3600	4	11	16	24700


> New Y[]: 
	
	 2  0  4  0  0  0  0  0  0  0  0  1  0  0  1  0  3  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 281 #######################


> Neighbours evaluated; 288
> Selected Move:	3630	3	16	1	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 282 #######################


> Neighbours evaluated; 286
> Selected Move:	3630	3	0	25	24500


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  2  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 283 #######################


> Neighbours evaluated; 281
> Selected Move:	3630	4	25	11	23600


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 284 #######################


> Neighbours evaluated; 285
> Selected Move:	3652	1	-1	22	30100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 285 #######################


> Neighbours evaluated; 301
> Selected Move:	3738	4	11	22	29300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  1  2  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 286 #######################


> Neighbours evaluated; 309
> Selected Move:	3759	3	11	24	29300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  2  0  1  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 287 #######################


> Neighbours evaluated; 306
> Selected Move:	3751	3	24	33	29300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  2  0  0  1  1  0  0  0  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 288 #######################


> Neighbours evaluated; 306
> Selected Move:	3708	4	22	33	29600


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0  0  2  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 289 #######################


> Neighbours evaluated; 311
> Selected Move:	3685	3	33	24	30000


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  2  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 290 #######################


> Neighbours evaluated; 301
> Selected Move:	3654	3	24	19	29700


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  2  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 291 #######################


> Neighbours evaluated; 272
> Selected Move:	3707	4	19	35	28800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  2  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 292 #######################


> Neighbours evaluated; 295
> Selected Move:	3703	3	22	34	26300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0  0  0  1  2  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 293 #######################


> Neighbours evaluated; 307
> Selected Move:	3702	3	26	32	27300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  1  0  1  2  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 294 #######################


> Neighbours evaluated; 284
> Selected Move:	3640	4	35	32	27800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  2  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 295 #######################


> Neighbours evaluated; 277
> Selected Move:	3679	3	35	3	27300


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  2  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 296 #######################


> Neighbours evaluated; 287
> Selected Move:	3689	3	32	8	27100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  2  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 297 #######################


> Neighbours evaluated; 306
> Selected Move:	3724	3	21	38	28100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  2  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 298 #######################


> Neighbours evaluated; 306
> Selected Move:	3718	3	8	23	28100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  2  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,125

## ITERATION 299 #######################


> Neighbours evaluated; 297
> Selected Move:	3695	3	38	6	27600


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  2  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 300 #######################


> Neighbours evaluated; 244
> Selected Move:	3747	3	14	21	27100


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  2  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 301 #######################


> Neighbours evaluated; 237
> Selected Move:	3737	3	23	39	26800


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 302 #######################


> Neighbours evaluated; 262
> Selected Move:	3682	3	39	15	27200


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  0  0  0  0  0  2  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 303 #######################


> Neighbours evaluated; 266
> Selected Move:	3601	3	3	14	27200


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  0  0  0  1  2  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 304 #######################


> Neighbours evaluated; 304
> Selected Move:	3665	3	15	23	27100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  2  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 305 #######################


> Neighbours evaluated; 281
> Selected Move:	3631	3	23	39	26800


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 306 #######################


> Neighbours evaluated; 294
> Selected Move:	3604	3	39	8	27100


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  2  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 307 #######################


> Neighbours evaluated; 282
> Selected Move:	3556	3	8	26	26600


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  2  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 308 #######################


> Neighbours evaluated; 288
> Selected Move:	3582	4	26	6	26400


> New Y[]: 
	
	 0  3  4  0  0  0  2  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 309 #######################


> Neighbours evaluated; 296
> Selected Move:	3558	4	6	25	26500


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  2  1  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 310 #######################


> Neighbours evaluated; 290
> Selected Move:	3550	3	6	3	26500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  2  1  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 311 #######################


> Neighbours evaluated; 269
> Selected Move:	3543	3	21	12	26500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  2  1  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 312 #######################


> Neighbours evaluated; 283
> Selected Move:	3535	3	34	39	27500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  2  1  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 313 #######################


> Neighbours evaluated; 192
> Selected Move:	3659	4	25	39	26800


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 314 #######################


> Neighbours evaluated; 264
> Selected Move:	3590	3	39	23	27100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  2  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 315 #######################


> Neighbours evaluated; 267
> Selected Move:	3549	3	23	15	27200


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  1  0  1  2  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 316 #######################


> Neighbours evaluated; 288
> Selected Move:	3520	3	15	24	27000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  2  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 317 #######################


> Neighbours evaluated; 220
> Selected Move:	3618	3	14	21	26500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  2  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 318 #######################


> Neighbours evaluated; 197
> Selected Move:	3638	3	24	11	26600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  2  1  0  0  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 319 #######################


> Neighbours evaluated; 215
> Selected Move:	3598	3	11	13	26300


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  0  1  2  0  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 320 #######################


> Neighbours evaluated; 151
> Selected Move:	3591	3	3	14	26300


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  1  2  1  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 321 #######################


> Neighbours evaluated; 263
> Selected Move:	3467	3	14	35	26800


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  0  1  2  0  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 322 #######################


> Neighbours evaluated; 105
> Selected Move:	3486	3	13	11	27100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  2  1  0  0  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,245

## ITERATION 323 #######################


> Neighbours evaluated; 100
> Selected Move:	3460	4	1	21	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  2  1  0  0  0  0  0  0  1  0  3  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 324 #######################


> Neighbours evaluated; 162
> Selected Move:	3520	3	21	14	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  2  1  0  3  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 325 #######################


> Neighbours evaluated; 246
> Selected Move:	3520	4	11	35	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  1  1  0  3  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  2  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 326 #######################


> Neighbours evaluated; 240
> Selected Move:	3520	4	14	11	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  3  1  0  1  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  2  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 327 #######################


> Neighbours evaluated; 228
> Selected Move:	3520	4	11	35	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  2  1  0  1  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  3  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,27

## ITERATION 328 #######################


> Neighbours evaluated; 225
> Selected Move:	3520	3	11	24	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  2  1  1  0  0  0  0  0  0  0  0  3  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,265

## ITERATION 329 #######################


> Neighbours evaluated; 224
> Selected Move:	3520	4	24	35	24700


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  3  1  1  0  0  0  0  0  0  0  0  2  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,26

## ITERATION 330 #######################


> Neighbours evaluated; 222
> Selected Move:	3520	4	24	14	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  3  0  0  0  0  1  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0  2  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 331 #######################


> Neighbours evaluated; 229
> Selected Move:	3520	4	35	24	24500


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  3  0  0  0  0  1  0  0  0  0  2  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 332 #######################


> Neighbours evaluated; 243
> Selected Move:	3520	3	14	17	24500


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  1  0  0  0  0  2  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,245

## ITERATION 333 #######################


> Neighbours evaluated; 183
> Selected Move:	3520	4	24	35	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  1  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0  2  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,24
________________________________________________________________

Best solution found: 3780
Run Termination time: 05.02.2010 00:05:28
Run duration: 00:15:53.3750000
________________________________________________________________
